- iterative subspace
- Макаров: итерационное подпространство
Универсальный англо-русский словарь. Академик.ру. 2011.
iterative subspace
Смотреть что такое "iterative subspace" в других словарях:
Iterative method — In computational mathematics, an iterative method is a mathematical procedure that generates a sequence of improving approximate solutions for a class of problems. A specific implementation of an iterative method, including the termination… … Wikipedia
Multilinear subspace learning — (MSL) aims to learn a specific small part of a large space of multidimensional objects having a particular desired property. It is a dimensionality reduction approach for finding a low dimensional representation with certain preferred… … Wikipedia
Krylov subspace — In linear algebra the Krylov subspace generated by an n by n matrix, A , and an n vector, b , is the subspace mathcal{K} n spanned by the vectors of the Krylov sequence:::mathcal{K} n = operatorname{span} , { b, Ab, A^2b, ldots, A^{n 1}b }. , It… … Wikipedia
DIIS — (direct inversion in the iterative subspace or direct inversion of the iterative subspace), also known as Pulay mixing, is an extrapolation technique. DIIS was developed by Peter Pulay in the field of computational quantum chemistry with the… … Wikipedia
Hartree-Fock — In computational physics and computational chemistry, the Hartree Fock (HF) method is an approximate method for the determination of the ground state wavefunction and ground state energy of a quantum many body system.The Hartree Fock method… … Wikipedia
Generalized valence bond — The generalized valence bond (GVB) method is one of the simplest and oldest valence bond method that uses flexible orbitals in the general way used by modern valence bond theory. The method was developed by the group of William A. Goddard, III… … Wikipedia
Peter Pulay — (Born September 20, 1941) in Veszprém, Hungary is a theoretical chemist. He is the Roger B. Bost Professor of Chemistry, in the Department of Chemistry and Biochemistry at the University of Arkansas, U.S.His most important contribution is the… … Wikipedia
Generalized minimal residual method — In mathematics, the generalized minimal residual method (usually abbreviated GMRES) is an iterative method for the numerical solution of a system of linear equations. The method approximates the solution by the vector in a Krylov subspace with… … Wikipedia
Arnoldi iteration — In numerical linear algebra, the Arnoldi iteration is an eigenvalue algorithm and an important example of iterative methods. Arnoldi finds the eigenvalues of general (possibly non Hermitian) matrices; an analogous method for Hermitian matrices is … Wikipedia
Perturbation theory (quantum mechanics) — In quantum mechanics, perturbation theory is a set of approximation schemes directly related to mathematical perturbation for describing a complicated quantum system in terms of a simpler one. The idea is to start with a simple system for which a … Wikipedia
Principal component analysis — PCA of a multivariate Gaussian distribution centered at (1,3) with a standard deviation of 3 in roughly the (0.878, 0.478) direction and of 1 in the orthogonal direction. The vectors shown are the eigenvectors of the covariance matrix scaled by… … Wikipedia
